Semi-Infinite Assignment And Transportation Games
نویسندگان
چکیده
منابع مشابه
Semi-infinite assignment problems and related games
In 1972 Shapley and Shubik introduced assignment games associated to finite assignment problems in which two types of agents were involved and they proved that these games have a non-empty core. In this paper we look at the situation where the set of one type is infinite and investigate when the core of the associated game is non-empty. Two infinite programming problems arise here, which we tac...
متن کاملOn the core of semi-infinite transportation games with divisible goods
The core of games arising from semi-infinite transportation situations with infinitely divisible goods is studied. In these situations one aims at maximizing the profit from transporting a good from a finite number of suppliers to an infinite number of demanders. This good is infinitely divisible. It is shown that the underlying primal and dual infinite programs have no duality gap. Further, th...
متن کاملSubsmooth semi-infinite and infinite optimization problems
We first consider subsmoothness for a function family and provide formulas of the subdifferential of the pointwsie supremum of a family of subsmooth functions. Next, we consider subsmooth infinite and semi-infinite optimization problems. In particular, we provide several dual and primal characterizations for a point to be a sharp minimum or a weak sharp minimum for such optimization problems.
متن کاملInfinite Games and Uniformization
The problem of solvability of infinite games is closely connected with the classical question of uniformization of relations by functions of a given class. We work out this connection and discuss recent results on infinite games that are motivated by the uniformization problem. The fundamental problem in the effective theory of infinite games was posed by Church in 1957 (“Church’s Problem”; see...
متن کاملSelfish Transportation Games
We study a natural strategic situation arising from the selection of shared means of transportation. Some clients (the players) are located on different nodes of a given graph and they want to be transported from their location to a common destination point (e.g. school, airport). A fixed number of resources (also called buses) is available and each client has to choose exactly one. Individual ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2000
ISSN: 1556-5068
DOI: 10.2139/ssrn.247670